//
// Created by 田建昆 on 2020/12/11.
//

#ifndef CODEBASE_PRIORITY_QUEUE_H
#define CODEBASE_PRIORITY_QUEUE_H

typedef struct priority_queue {
    int *key;
    int size;
    int n;
}priority_queue;

#define size(pq) (pq)->n
#define is_empty(pq) (size(pq) == 0)

priority_queue* priority_queue_create(int size);
void priority_queue_insert(priority_queue* pq, int v);
int priority_queue_delmin(priority_queue *pq);


#endif //CODEBASE_PRIORITY_QUEUE_H
